Easy distributions for combinatorial optimization problems with probabilistic constraintsFORTZ, Bernard; POSS, Michael.Operations research letters. 2010, Vol 38, Num 6, pp 545-549, issn 0167-6377, 5 p.Article

Special Issue on Network Optimization (INOC 2007)FORTZ, Bernard; GOUVEIA, Luis.Networks (New York, NY). 2010, Vol 55, Num 3, issn 0028-3045, 131 p.Conference Proceedings

A Branch-and-Cut Algorithm for the Ring Spur Assignment ProblemCARROLL, Paula; FORTZ, Bernard; LABBE, Martine et al.Networks (New York, NY). 2013, Vol 61, Num 2, pp 89-103, issn 0028-3045, 15 p.Conference Paper

Distinguished Vertices in Probabilistic Rooted GraphsGORDON, Gary; JAGER, Ekaterina.Networks (New York, NY). 2010, Vol 55, Num 3, pp 181-186, issn 0028-3045, 6 p.Conference Paper

Exact and Performance-Guaranteed Multicast Algorithms for Lifetime Optimization in WANETsSONG GUO; LEUNG, Victor.Networks (New York, NY). 2010, Vol 55, Num 3, pp 287-297, issn 0028-3045, 11 p.Conference Paper

Application of Semi Definite Relaxation and Variable Neighborhood Search for Multiuser Detection in Synchronous CDMALISSER, Abdel; LOPEZ, Rafael.Networks (New York, NY). 2010, Vol 55, Num 3, pp 187-193, issn 0028-3045, 7 p.Conference Paper

Lagrangean-Based Decomposition Algorithms for Multicommodity Network Design Problems with Penalized ConstraintsBEKTAS, Tolga; CHOUMAN, Mervat; GABRIEL CRAINIC, Teodor et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 171-180, issn 0028-3045, 10 p.Conference Paper

Solving a Resource Allocation Problem in Wireless Mesh Networks: A Comparison Between a CP-Based and a Classical Column GenerationCAPONE, Antonio; CARELLO, Giuliana; FILIPPINI, Ilario et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 221-233, issn 0028-3045, 13 p.Conference Paper

SNDlib 1.0: Survivable Network Design LibraryORLOWSKI, S; WESSÄLY, R; PIORO, M et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 276-286, issn 0028-3045, 11 p.Conference Paper

A Polyhedral Study of the Network Pricing Problem with Connected Toll ArcsHEILPORN, Géraldine; LABBE, Martine; MARCOTTE, Patrice et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 234-246, issn 0028-3045, 13 p.Conference Paper

The Generalized Minimum Edge-Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood SearchBIN HU; LEITNER, Markus; RAIDL, Gunther R et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 256-275, issn 0028-3045, 20 p.Conference Paper

A Branch-and-Cut Algorithm for Partition ColoringFROTA, Yuri; MACULAN, Nelson; NORONHA, Thiago F et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 194-204, issn 0028-3045, 11 p.Conference Paper

Computational Experience with a SDP-Based Algorithm for Maximum Cut with Limited UnbalanceGALBIATI, Giulia; GUALANDI, Stefano; MAFFIOLI, Francesco et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 247-255, issn 0028-3045, 9 p.Conference Paper

The Regenerator Location ProblemSI CHEN; LJUBIE, Ivana; RAGHAVAN, S et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 205-220, issn 0028-3045, 16 p.Conference Paper